#include <bits/stdc++.h>
using namespace std;
int n;
int cnt;
int mons[100005];
void battle(int l,int r){
    if(r>n)return;
    if(mons[l]<mons[r]){
        cnt++;
        battle(l+1,r+1);
    }
    else{
        battle(l,r+1);
    }
    return;
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cnt=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>mons[i];
    }
    sort(mons,&mons[n+1]);
    battle(1,2);
    int ans=n-cnt;
    cout<<ans;
return 0;
}


